Convex dominates concave: An exclusion principle in discrete-time Kolmogorov systems
نویسندگان
چکیده
منابع مشابه
Adaptive control of discrete time systems with concave/convex parametrizations
Abstract: This paper considers the adaptive control of a class of nonlinear discrete time system with nonlinearly parametrized functions. In particular, the focus is on concave or convex parametrizations with unknown parameters. The solutions involved 2 tuning functions which are determined by a minmax optimization approach much like the continuous time counterparts found in the literature. Dir...
متن کاملA Two-Sided Discrete-Concave Market with Bounded Side Payments: An Approach by Discrete Convex Analysis
The marriage model due to Gale and Shapley and the assignment model due to Shapley and Shubik are standard in the theory of two-sided matching markets. We give a common generalization of these models by utilizing discrete concave functions and considering bounded side payments. We show the existence of a pairwise stable outcome in our model. Our present model is a further natural extension of t...
متن کاملOptimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کاملInclusion Principle for Discrete-time Time-varying Systems
In this paper the concept of inclusion is applied to dynamic linear discrete-time time-varying dynamic systems. Starting from general definitions, which include restriction and aggregation as special cases, inclusion conditions are derived. It is proved that any inclusion can be considered as a specific composition of sequences of restriction/ aggregation pairs. The paper contains also a formul...
متن کاملDiscrete tomography by convex-concave regularization and D.C. programming
We present a novel approach to the tomographic reconstruction of binary objects from few projection directions within a limited range of angles. A quadratic objective functional over binary variables comprising the squared projection error and a prior penalizing non-homogeneous regions, is supplemented with a concave functional enforcing binary solutions.Application of a primal-dual subgradient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2006
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-06-08309-2